Combinatorial optimization problems with normal random costs
نویسنده
چکیده
We consider combinatorial optimization problems with random jointly normal costs. Target-probability efficient solutions are those that grant a given target at a certain probability and no other solution can grant the same target at a higher probability. Since the costs belong to a location-scale family the efficient solutions have a simple geometric characterization in terms of mean and variance. Computing efficient solutions can be carried out by an iteration scheme calling for the solution of a constrained integer programming problem.
منابع مشابه
Asymptotic Results for Random Multidimensional Assignment Problems
The multidimensional assignment problem (MAP) is an NP-hard combinatorial optimization problem occurring in applications such as data association and target tracking. In this paper, we investigate characteristics of the mean optimal solution values for random MAPs with axial constraints. Throughout the study, we consider cost coefficients taken from three different random distributions: uniform...
متن کاملOptimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm
Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve the efficiency of inventory management and find the economic order quantity and economic p...
متن کاملPhase Transitions in Parameter Rich Optimization Problems
Most real world combinatorial optimization problems are affected by noise in the input data. Search algorithms to identify “good” solutions with low costs behave like the dynamics of large disordered particle systems, e.g., random networks or spin glasses. Such solutions to noise perturbed optimization problems are characterized by Gibbs distributions when the optimization algorithm searches fo...
متن کاملOn the Asymptotic Properties of Random Multidimensional Assignment Problems
The Multidimensional Assignment Problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in [1] and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when ...
متن کاملRecoverable robust combinatorial optimization problems.dvi
This paper deals with two Recoverable Robust (RR) models for combinatorial optimization problems with uncertain costs. These models were originally proposed by Büsing (2012) for the shortest path problem with uncertain costs. In this paper, we generalize the RR models to a class of combinatorial optimization problems with uncertain costs and provide new positive and negative complexity results ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 41 شماره
صفحات -
تاریخ انتشار 2013